Gröbner basis computation of Drazin inverses with multivariate rational function entries

نویسندگان

Juana Sendra

J. Rafael Sendra

چکیده

In this paper we show how to apply Gröbner bases to compute the Drazin inverse of a matrix with multivariate rational functions as entries. When the coefficients of the rational functions depend on parameters, we give sufficient conditions for the Drazin inverse to specialize properly. In addition, we extend the method to weighted Drazin inverses. We present an empirical analysis that shows a good timing performance of the method. keywords Drazin inverse, Gröbner bases, symbolic computation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The representation of the Drazin inverse of anti-triangular operator matrices based on resolvent expansions

Keywords: Drazin inverse Anti-triangular operator matrix Resolvent expansion a b s t r a c t This paper deals with the anti-triangular operator matrix M ¼ A B C 0 with A 2 ¼ A and CA p B ¼ 0. Using the resolvent expansion technique, we obtain the explicit representation of the Drazin inverse of M, in terms of its entries and the Drazin inverses of the entries and their compositions. The result ...

متن کامل

Working with Multivariate Polynomials in Maple

We comment on the implementation of various algorithms in multivariate polynomial theory. Specifically, we describe a modular computation of triangular sets and possible applications. Next we discuss an implementation of the F4 algorithm for computing Gröbner bases. We also give examples of how to use Gröbner bases for vanishing ideals in polynomial and rational function interpolation.

متن کامل

Drazin Inverses of Operators with Rational Resolvent

Let A be a bounded linear operator on a Banach space such that the resolvent of A is rational. If 0 is in the spectrum of A, then it is well known that A is Drazin invertible. We investigate spectral properties of the Drazin inverse of A. For example we show that the Drazin inverse of A is a polynomial in A.

متن کامل

On Lucky Primes

Winkler (1988) and Pauer (1992) present algorithms for a Hensel lifting of a modular Gröbner basis over lucky primes to a rational one. They have to solve a linear system with modular polynomial entries that requires another (modular) Gröbner basis computation. After an extension of luckiness to arbitrary (commutative noetherian) base rings we show in this paper that for a homogeneous polynomia...

متن کامل